Parallel chen-han (PCH) algorithm for discrete geodesics
نویسندگان
چکیده
منابع مشابه
Improving Chen & Han’s Algorithm on the Discrete Geodesic Problem
The computation of geodesic distances or paths between two points on triangulated meshes is a common operation in many computer graphics applications. In this paper, we present an exact algorithm for the single-source all-vertices shortest path problem. Mitchell et al. (MMP) proposed an O(n2 log n) method in 1987, based on Dijkstra’s algorithm, where n is the complexity of the polyhedral surfac...
متن کاملA Parallel Algorithm for Discrete Gabor Transforms
Serial algorithms to evaluate the Gabor transform of a discrete signal are bound by the length of signal for which the transform can be evaluated. The time taken, if machine memory and other factors are ignored, grows as order O(N) making it unsuitable for transforms of large signal lengths. In this paper, we present a parallel algorithm to generate the computationally intensive Gabor transform...
متن کاملA Global Algorithm for Geodesics
The problem of finding a geodesic joining given points x0; x1 in a connected complete Riemannian manifold requires much more effort than determining a geodesic from initial data. Boundary value problems of this type are sometimes solved using shooting methods, which work best when good initial guesses are available, especially when x0; x1 are nearby. Galerkin methods have their drawbacks too. T...
متن کاملDiscrete Geodesics and Cellular Automata
This paper proposes a dynamical notion of discrete geodesics, understood as straightest trajectories in discretized curved spacetime. The notion is generic, as it is formulated in terms of a general deviation function, but readily specializes to metric spaces such as discretized pseudo-riemannian manifolds. It is effective: an algorithm for computing these geodesics naturally follows, which all...
متن کاملThe Parallel Algorithm for the 2-D Discrete Wavelet Transform
The discrete wavelet transform can be found at the heart of many image-processing algorithms. Until now, the transform on general-purpose processors (CPUs) was mostly computed using a separable lifting scheme. As the lifting scheme consists of a small number of operations, it is preferred for processing using single-core CPUs. However, considering a parallel processing using multi-core processo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2014
ISSN: 0730-0301,1557-7368
DOI: 10.1145/2534161